منابع مشابه
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix derived from the web’s hyperlink structure and a user-centred model of web-surfing behaviour. As the web has expanded and as demand for user-tailored web page ordering metrics has grown, scalable parallel computation ...
متن کاملDirected Hypergraph Planarity
Directed hypergraphs are generalizations of digraphs and can be used to model binary relations among subsets of a given set. Planarity of hypergraphs was studied by Johnson and Pollak; in this paper we extend the planarity concept to directed hypergraphs. It is known that the planarity of a digraph relies on the planarity of its underlying graph. However, for directed hypergraphs, this property...
متن کاملLocal Partitioning for Directed Graphs Using PageRank
A local partitioning algorithm finds a set with small conductance near a specified seed vertex. In this paper, we present a generalization of a local partitioning algorithm for undirected graphs to strongly connected directed graphs. In particular, we prove that by computing a personalized PageRank vector in a directed graph, starting from a single seed vertex within a set S that has conductanc...
متن کاملA Directed Hypergraph Model for RDF
1 Related Work An RDF document can be viewed as a graph: nodes are resources and arcs are properties. Formally [4], suppose there are three infinite sets: U (URIs), B = {bj : j ∈ N} (blank nodes), and L (literals). (s, p, o) ∈ (U∪B)×U×(U∪B∪L) is an RDF triple, s is called the subject, p the predicate, and o the object. An RDF graph T is a set of RDF triples. The universe of T , univ(T ), is the...
متن کاملAn advanced pre-positioning method for the force-directed graph visualization based on pagerank algorithm
Graph visualization techniques aim to help users obtain deep insights about the structure and evolution of graphs through minimizing visual confusion and real-time updating of the drawing. This demands high effectiveness of the drawing algorithms to produce layout of graphs with few edge crossings. However, the classical force-directed algorithms fail to satisfy this requirement. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
سال: 2019
ISSN: 0973-8975,2454-7190
DOI: 10.26782/jmcms.spl.4/2019.11.00004